Interconnected Hierarchical Rank-structured Methods for Directly Solving and Preconditioning the Helmholtz Equation
نویسندگان
چکیده
In this paper, we design interconnected hierarchical rank-structured methods for the fast direct solution and effective preconditioning of the Helmholtz equation. First, for essentially elliptic PDEs, a direct method is proposed to exploit interconnected structures within two hierarchical layers: the hierarchical partitioning of a large problem into sub-problems for smaller subdomains, and the hierarchically semiseparable (HSS) approximation for the sub-problems. Interconnected low-rank structures enable extensive reuse of information among computations associated with different subdomains, which greatly reduces the cost and memory usage for the construction of structured representations as needed in fast structured direct solutions. In contract, previous structured direct solvers usually require expensive structured constructions which contribute to the dominant cost. Our direct method can quickly solve either the low-frequency or the damped Helmholtz equation. The factorization cost can be as low as O(n) in 2D and O(n logn) in 3D, where n is the matrix size. For the high-frequency case, we build a preconditioner by creating artificial damping near the boundary of subdomains. We give the first result on how the magnitude of the damping parameter affects the compressibility of HSS representation of boundary maps. For O(ω2−γ) damping where ω is the angular frequency and γ ∈ [0, 1], the factorization of the preconditioner costs O(ω2+γ) in 2D and O(ω3+3γ) in 3D. For the interior impedance problem, we show that the condition number of the preconditioned system is O(ω1−γ), and prove GMRES convergence for general cases based on the Elman estimates. Comparing with solving the preconditioner problem iteratively, the rank-structured approach gives a robust solution for various choices of damping, and has a predictable tradeoff between cost the and effectiveness.
منابع مشابه
Stable Gaussian radial basis function method for solving Helmholtz equations
Radial basis functions (RBFs) are a powerful tool for approximating the solution of high-dimensional problems. They are often referred to as a meshfree method and can be spectrally accurate. In this paper, we analyze a new stable method for evaluating Gaussian radial basis function interpolants based on the eigenfunction expansion. We develop our approach in two-dimensional spaces for so...
متن کاملApplication of Decoupled Scaled Boundary Finite Element Method to Solve Eigenvalue Helmholtz Problems (Research Note)
A novel element with arbitrary domain shape by using decoupled scaled boundary finite element (DSBFEM) is proposed for eigenvalue analysis of 2D vibrating rods with different boundary conditions. Within the proposed element scheme, the mode shapes of vibrating rods with variable boundary conditions are modelled and results are plotted. All possible conditions for the rods ends are incorporated ...
متن کاملHierarchical low-rank approximation of tensors by successive rank one corrections for preconditioning and solving high dimensional linear systems
We propose an algorithm for preconditioning and solving high dimensional linear systems of equations in tensor format. The algorithm computes an approximation of a tensor in hierarchical Tucker format in a subspace constructed from successive rank one corrections. The algorithm can be applied for the approximation of a solution or of the inverse of an operator. In the latter case, properties su...
متن کاملOn Approximate Cardinal Preconditioning Methods for Solving PDEs with Radial Basis Functions
The approximate cardinal basis function (ACBF) preconditioning technique has been used to solve partial differential equations (PDEs) with radial basis functions (RBFs). In [31], a preconditioning scheme that is based upon constructing the least-squares approximate cardinal basis function from linear combinations of the RBF-PDE matrix elements has shown very attractive numerical results. This p...
متن کاملA convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations
We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018